Intuitionistic implication without disjunction
نویسندگان
چکیده
We investigate fragments of intuitionistic propositional logic containing implication but not disjunction. These fragments are finite, but their size grows superexponentially with the number of generators. Exact models are used to characterize the fragments.
منابع مشابه
Uniform Definability in Propositional Dependence Logic
Both propositional dependence logic and inquisitive logic are expressively complete. As a consequence, every formula in the language of inquisitive logic with intuitionistic disjunction or intuitionistic implication can be translated equivalently into a formula in the language of propositional dependence logic without these two connectives. We show that although such a (noncompositional) transl...
متن کاملTruth Values and Connectives in Some Non-Classical Logics
The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...
متن کاملNew Operations on Intuitionistic Fuzzy Soft Sets based on Second Zadeh's logical Operators
In this paper, three new operations have been introduced on intuitionistic fuzzy soft sets. They are based on Second Zadeh‟s implication, conjunction and disjunction operations on intuitionistic fuzzy sets. Some examples of these operations were given and a few important properties were also studied. Index Terms — Second Zadeh‟s implication, Second Zadeh‟s conjunction, Second Zadeh‟s disjunctio...
متن کاملThe Complexity of Disjunction in Intuitionistic Logic
In the formal study of security protocols and access control systems, fragments of intuitionistic logic play a vital role. These are required to be efficient, and are typically disjunction-free. In this paper, we study the complexity of adding disjunction to these subsystems. Our lower bound results show that very little needs to be added to disjunction to get co-NP-hardness, while our upper bo...
متن کاملBi-intuitionistic Boolean Bunched Logic
We formulate and investigate a bi-intuitionistic extension, BiBBI, of the well known bunched logic Boolean BI (BBI), obtained by combining classical logic with full intuitionistic linear logic as considered by Hyland and de Paiva (as opposed to standard multiplicative intuitionistic linear logic). Thus, in addition to the multiplicative conjunction ∗ with its adjoint implication —∗ and unit ⊤∗,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Log. Comput.
دوره 22 شماره
صفحات -
تاریخ انتشار 2012